Search results for "JPEG 2000"
showing 10 items of 10 documents
An efficient hardware implementation of MQ decoder of the JPEG2000
2014
Abstract JPEG2000 is an international standard for still images intended to overcome the shortcomings of the existing JPEG standard. Compared to JPEG image compression techniques, JPEG2000 standard has not only better not only has better compression ratios, but it also offers some exciting features. As it’s hard to meet the real-time requirement of image compression systems by software, it is necessary to implement compression system by hardware. The MQ decoder of the JPEG2000 standard is an important bottleneck for real-time applications. In order to meet the real-time requirement we propose in this paper a novel architecture for a MQ decoder with high throughput which is comparable to tha…
Application based on dynamic reconfiguration of field-programmable gate arrays: JPEG 2000 arithmetic decoder
2005
This paper describes the implementation of a part of the JPEG 2000 algorithm (MQ decoder and arithmetic decoder) on a field-programmable gate array (FPGA) board by using dynamic reconfiguration. A comparison between static and dynamic reconfiguration is presented, and new analysis criteria (spatiotemporal efficiency, logic cost, and performance time) have been defined. The MQ decoder and arithmetic decoder are attractive for dynamic reconfiguration implementation in applications without parallel processing. This implementation is done on an architecture designed to study the dynamic reconfiguration of FPGAs: the ARDOISE architecture. The obtained implementation, based on four partial config…
Improved Statistically Based Retrievals via Spatial-Spectral Data Compression for IASI Data
2019
In this paper, we analyze the effect of spatial and spectral compression on the performance of statistically based retrieval. Although the quality of the information is not com- pletely preserved during the coding process, experiments reveal that a certain amount of compression may yield a positive impact on the accuracy of retrievals. We unveil two strategies, both with interesting benefits: either to apply a very high compression, which still maintains the same retrieval performance as that obtained for uncompressed data; or to apply a moderate to high compression, which improves the performance. As a second contribution of this paper, we focus on the origins of these benefits. On the one…
Data Compression Using Wavelet and Local Cosine Transforms
2015
The chapter describes an algorithm that compresses two-dimensional data arrays, which are piece-wise smooth in one direction and have oscillating events in the other direction. Seismic, hyper-spectral and fingerprints data, for example, have such a mixed structure. The transform part of the compression process is an algorithm that combines wavelet and local cosine transform (LCT). The quantization and the entropy coding parts of the compression are taken from the SPIHT codec. To efficiently apply the SPIHT codec to a mixed coefficients array, reordering of the LCT coefficients takes place. On the data arrays, which have the mixed structure, this algorithm outperforms other algorithms that a…
The effect of wavelet and discrete cosine transform compression of digital radiographs on the detection of subtle proximal caries. ROC analysis.
2007
The study compared diagnostic performances of 2 different image compression methods: JPEG (discrete cosine transform; Joint Photographic Experts Group compression standard) versus JPEG2000 (discrete wavelet transform), both at a compression ratio of 12:1, from the original uncompressed TIFF radiograph with respect to the detection of non-cavitated carious lesions. Therefore, 100 approximal surfaces of 50 tooth pairs were evaluated on the radiographs by 10 experienced observers using a 5-point confidence scale. Observations were carried out on a standardized viewing monitor under subdued light conditions. The proportion of diseased surfaces was balanced to approximately 50% to avoid bias. Tr…
Robust Light Field Watermarking by 4D Wavelet Transform
2020
Unlike common 2D images, the light field representation of a scene delivers spatial and angular description which is of paramount importance for 3D reconstruction. Despite the numerous methods proposed for 2D image watermarking, such methods do not address the angular information of the light field. Hence the exploitation of such methods may cause severe destruction of the angular information. In this paper, we propose a novel method for light field watermarking with extensive consideration of the spatial and angular information. Considering the 4D innate of the light field, the proposed method incorporates 4D wavelet for the purpose of watermarking and converts the heavily-correlated chann…
A new algorithm for bit rate allocation in JPEG2000 tile encoding
2004
A new algorithm for allocating a given bit rate to different image tiles in the JPEG2000 encoding system is proposed. The algorithm outperforms other approaches commonly used in implementations. The new algorithm is suitable when information content is not equally distributed across the image. It is based on the computation of an index of the information content of each tile. To implement the proposed approach, we modified JasPer, a free software-based JPEG2000 coder implementation (Adams, M.D. and Kossentini, F., Proc. IEEE Int. Conf. on Image Process., vol.2, p.53-6, 2000). The experimentation was carried out on a subset of the JPEG2000 test images. Experimental results are reported, show…
Implementation of JPEG2000 arithmetic decoder using dynamic reconfiguration of FPGA
2005
This paper describes implementation of a part of JPEG2000 algorithm (MQ-Decoder and arithmetic decoder) on a FPGA board using dynamic reconfiguration. Comparison between static and dynamic reconfiguration is presented and new analysis criteria (time performance, logic cost, spatio-temporal efficiency) are defined. MQ-decoder and arithmetic decoder can be classified in the most attractive case for dynamic reconfiguration implementation: applications without parallelism by functions. This implementation is done on an architecture designed to study dynamic reconfiguration of FPGAs: the ARDOISE architecture. The implementation obtained, based on four partial configurations of arithmetic decoder…
Kolmogorov superposition theorem for image compression
2012
International audience; The authors present a novel approach for image compression based on an unconventional representation of images. The proposed approach is different from most of the existing techniques in the literature because the compression is not directly performed on the image pixels, but is rather applied to an equivalent monovariate representation of the wavelet-transformed image. More precisely, the authors have considered an adaptation of Kolmogorov superposition theorem proposed by Igelnik and known as the Kolmogorov spline network (KSN), in which the image is approximated by sums and compositions of specific monovariate functions. Using this representation, the authors trad…
Terrain data compression using wavelet-tiled pyramids for online 3D terrain visualization
2013
Last years have witnessed the widespread use of online terrain visualization applications. However, the significant improvements achieved in sensing technologies have allowed an increasing size of the terrain databases. These increasing sizes represent a serious drawback when terrain data must be transmitted and rendered at interactive rates. In this paper, we propose a novel wavelet-tiled pyramid for compressing terrain data that replaces the traditional multiresolution pyramid usually used in wavelet compression schemes. The new wavelet-tiled pyramid modifies the wavelet analysis and synthesis processes, allowing an efficient transmission and reconstruction of terrain data in those applic…